On incidence coloring for some cubic graphs
نویسندگان
چکیده
منابع مشابه
On incidence coloring for some cubic graphs
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with ∆+2 colors, where ∆ is the maximum degree of a graph. Although this conjecture was solved in the negative by an example in [1], it might hold for some special classes of graphs. In this paper, we consider graphs with maximum degree ∆ = 3 and show that the conjecture holds for cubic Hamiltonian graphs and some...
متن کاملStrong edge-coloring for cubic Halin graphs
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open...
متن کاملOptimal acyclic edge-coloring of cubic graphs
? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please...
متن کاملRelaxed two-coloring of cubic graphs
We show that any graph of maximum degree at most has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most . On the other hand for any constant we exhibit a -regular graph, such that the deletion of any independent set leaves at least one component of order greater than . Similar results are obtained for coloring ...
متن کاملOn conditional coloring of some graphs
For integers r and k > 0 (k > r), a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r, d(v)} differently colored neighbors, where d(v) is the degree of v. Given an r, for a graph G we are interested in obtaining a conditional coloring using minimum k — this value is denoted by χ r (G), called the r th order conditional chromati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00457-5